Chapitre 4 : Conclusions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4. Conclusions

15 4. The object-oriented and database fields can try to merge their capabilities to arrive at systems which can smoothly integrate the facilities for both, without prohibiting either a purely database-oriented approach or a purely object-oriented approach to the problem. We obviously prefer the fourth solution, and we believe that it is a promising direction to pursue. This presupposes, howeve...

متن کامل

4. Conclusions

Although the incremental approach with spatiotemporal correlation provide roughly the same gain in accuracy as the global one, the running time is clearly much shorter. The ratio of running times when neglecting one or both of the spatial or temporal correlations is different for the global vs. incremental approach: for the global one, it is more expensive to consider temporal correlations, whi...

متن کامل

4 Conclusions

In this work we implemented a parallel Radiosity rendering algorithm on a loosely-coupled cluster of PCs. The initial naive algorithm did not perform well, and in fact the computation time increased with the number of machines. We then applied a handful of tunings and optimization techniques which eventually made the algorithm execute eeciently, achieving speedups close to optimal. Previous rel...

متن کامل

4 Conclusions

This study demonstrates the ecacy of neural implementations of multistage and tree-search quantization. For xed branching ratio we have seen that the tree-search quantizer consistently outperforms the multi-stage structure, though at considerable resource cost. For networks with equal neural resource, the multistage architecture returns signicantly lower mse than the at and tree-search architec...

متن کامل

4 Conclusions 3.2 System Characterization

t s =1000 t w =1 t s =1000 t w =50 t s =50000 t w =10 t s =1000 t w =1 t s =1000 t w =50 t s =50000 t w =10 (a) (b) (c) (d) (e) (f) (g) Figure 2: Scalability plots of the system for eigenvalue computation on a line. In all cases, t c =1 and R=2 20. Plots in (a), (b), and (c) correspond to fixed problem-size analysis. Plots in (d), (e) and (f) correspond to time-constrained analysis. Plot in (g)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue Forestière Française

سال: 1985

ISSN: 1951-6827,0035-2829

DOI: 10.4267/2042/21805